Spatial Straight-Line Linkages by Factorization of Motion Polynomials
نویسندگان
چکیده
منابع مشابه
Spatial Straight Line Linkages by Factorization of Motion Polynomials
We use the recently introduced factorization of motion polynomials for constructing overconstrained spatial linkages with a straight line trajectory. Unlike previous examples, the end-effector motion is not translational and the link graph is a cycle. In particular, we obtain a number of linkages with four revolute and two prismatic joints and a remarkable linkage with seven revolute joints one...
متن کامل7R Darboux Linkages by Factorization of Motion Polynomials
In this paper, we construct two types of 7R closed single loop linkages by combining different factorizations of a general (non-vertical) Darboux motion. These factorizations are obtained by extensions of a factorization algorithm for a generic rational motion. The first type of 7R linkages has several one-dimensional configuration components and one of them corresponds to the Darboux motion. T...
متن کاملFactorization of Polynomials Given by Straight-Line Programs
An algorithm is developed for the factorization of a multivariate polynomial represented by a straight-line program into its irreducible factors. The algorithm is in random polynomial-time as a function in the input size, total degree, and binary coefficient length for the usual coefficient fields and outputs a straight-line program, which with controllably high probability correctly determines...
متن کاملFactorization of Motion Polynomials
In this paper, we consider the existence of a factorization of a monic, bounded motion polynomial. We prove existence of factorizations, possibly after multiplication with a real polynomial and provide algorithms for computing polynomial factor and factorizations. The first algorithm is conceptually simpler but may require a high degree of the polynomial factor. The second algorithm gives an op...
متن کاملInterpolation of polynomials given by straight-line programs
We give an algorithm for the interpolation of a polynomial A given by a straight-line program. Its complexity is polynomial in τ, log(d), L, n, where τ is an input bound on the number of terms in A, d is a bound on its partial degree in all variables, L is the length of the given straight-line program and n is the number of variables.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mechanisms and Robotics
سال: 2015
ISSN: 1942-4302,1942-4310
DOI: 10.1115/1.4031806